A superposition oriented theorem prover
نویسندگان
چکیده
منابع مشابه
A Superposition Oriented Theorem Prover
A theorem proving procedure is described which combines the approach of locking resolution with that of rewriting systems. Indeed, both the binary resolution and a complete restr ict ion of paramodulation are embodied by an extension of the rewriting operation called superposition. Experimental results are reported and compared with l i terature automated proofs.
متن کاملBeagle - A Hierarchic Superposition Theorem Prover
Beagle is an automated theorem prover for first-order logic modulo built-in theories. It implements a refined version of the hierarchic superposition calculus. This system description focuses on Beagle’s proof procedure, background reasoning facilities, implementation, and experimental results.
متن کاملA Theorem Prover-Based Analysis Tool for Object-Oriented Databases
We present a theorem-prover based analysis tool for object-oriented database systems with integrity constraints. Object-oriented database specifications are mapped to higher-order logic (HOL). This allows us to reason about the semantics of database operations using a mechanical theorem prover such as Isabelle or PVS. The tool can be used to verify various semantics requirements of the schema (...
متن کاملDesigning a Theorem Prover
ion, and substitution is simple: fun replace_term (u,new) t = if t=u then new else case t of Fun(a,ts) => Fun(a, map (replace_term(u,new)) ts) | _ => t; fun abstract t = let fun abs i (Pred(a,ts)) = Pred(a, map (replace_term (t, Bound i)) ts) | abs i (Conn(b,As)) = Conn(b, map (abs i) As) | abs i (Quant(q,b,A)) = Quant(q, b, abs (i+1) A) in abs 0 end; fun subst_bound t = let fun subst i (Pred(a...
متن کاملIleantap: an Intuitionistic Theorem Prover Ileantap: an Intuitionistic Theorem Prover
We present a Prolog program that implements a sound and complete theorem prover for rst-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an additional string uniica-tion to ensure the particular restrictions in intuitionistic logic. Due to the modular treatment of the diierent logical connectives the implementation can easily be adapted to deal with other n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1985
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90011-8